A Fast Quasi-Newton Adaptive Algorithm Based on Approximate Inversion of the Autocorrelation Matrix

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms

We develop and analyze a broad family of stochastic/randomized algorithms for inverting a matrix. We also develop specialized variants maintaining symmetry or positive definiteness of the iterates. All methods in the family converge globally and linearly (i.e., the error decays exponentially), with explicit rates. In special cases, we obtain stochastic block variants of several quasiNewton upda...

متن کامل

A numerically stable fast Newton type adaptive filter based on order update fast least squares algorithm

The numerical property of an adaptive filter algorithm is the most important problem in practical applications. Most fast adaptive filter algorithms have the numerical instability problem and the fast Newton transversal filter (FNTF) algorithms are no exception. In this paper, we propose a numerically stable fast Newton type adaptive filter algorithm. Two problems are dealt with in the paper. F...

متن کامل

A Parallel Matrix Inversion Algorithm on Torus with Adaptive Pivoting

This paper presents a parallel algorithm for matrix inversion on a torus interconnected MIMD-MC multi-processor. This method is faster than the parallel implementations of other widely used methods namely Gauss-Jordan, Gauss-Seidal or LU decomposition based inversion. This new algorithm also introduces a novel technique, called adaptive pivoting, for solving the zero pivot problem at no cost. O...

متن کامل

A Quasi-newton Adaptive Algorithm for Estimating Generalized Eigenvectors

We first introduce a constrained minimization formulation for the generalized symmetric eigenvalue problem and then recast it into an unconstrained minimization problem by constructing an appropriate cost function. Minimizer of this cost function corresponds to the eigenvector corresponding to the minimum eigenvalue of the given symmetric matrix pencil and all minimizers are global minimizers. ...

متن کامل

A numerically stable fast Newton-type adaptive filter based on order recursive least squares algorithm

This paper presents a numerically stable fast Newton-type adaptive filter algorithm. Two problems are dealt with in the paper. First, we derive the proposed algorithm from an order-recursive least squares algorithm. The result of the proposed algorithm is equivalent to that of the fast Newton transversal filter (FNTF) algorithm. However, the derivation process is different. Instead of extending...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2020

ISSN: 2169-3536

DOI: 10.1109/access.2020.2979863